An O( P Nl)-iteration Combined Phase I-phase Ii Potential Reduction Algorithm for Linear Programming
نویسنده
چکیده
We show that a modiication of the combined Phase I-Phase II interior-point algorithm for linear programming, due to Anstreicher, de Ghellinck and Vial, Fra-ley, and Todd, terminates in O(p nL) iterations from a suitable initial (interior but infeasible) solution. The algorithm either detects infeasibility, or approaches feasibility and optimality simultaneously, or generates a feasible primal-dual pair whose initial potential value is properly bounded, so that any O(p nL)-iteration algorithm can complete the rest of the work.
منابع مشابه
A Superlinearly Convergent O( P Nl)-iteration Algorithm for Linear Programming
In this note we consider a large step modiication of the Mizuno-Todd-Ye O(p nL) predictor-corrector interior-point algorithm for linear programming. We demonstrate that the modiied algorithm maintains its O(p nL)-iteration complexity, while exhibiting superlinear convergence for general problems and quadratic convergence for non-degenerate problems. To our knowledge, this is the rst constructio...
متن کاملA Potential Reduction Algorithm with User-Specified Phase I-Phase II Balance for Solving a Linear Program from an Infeasible Warm Start
This paper develops a potential reduction algorithm for solving a linear-programming problem directly from a "warm start" initial point that is neither feasible nor optimal. The algorithm is of an "interior point" variety that seeks to reduce a single potential function which simultaneously coerces feasibility improvement (Phase I) and objective value improvement (Phase II). The key feature of ...
متن کاملOn the Complexity of a Class of Projective Interior Point Methods
In this paper we present a generic projective interior point algorithm for linear programming which includes modiied versions of Karmarkar's original algorithm and most other projective algorithms that have been proposed as special cases. We show that this class of algorithms has a worst case iteration bound of O(p nL) and is closely related to the class of potential reduction interior point me...
متن کاملNew complexity results for the Iri-Imai method
In this paper we show that the number of main iterations required by the Iri-Imai algorithm to solve a linear programming problem is O(nL). Moreover, we show that a modification of this algorithm requires only O( √ nL) main iterations. In this modification we measure progress by means of the primal-dual potential function.
متن کاملA Parametric Approach for Solving Multi-Objective Linear Fractional Programming Phase
In this paper a multi - objective linear fractional programming problem with the fuzzy variables and vector of fuzzy resources is studied and an algorithm based on a parametric approach is proposed. The proposed solving procedure is based on the parametric approach to find the solution, which provides the decision maker with more complete information in line with reality. The simplicity of the ...
متن کامل